Throughput of Rateless Codes Over Broadcast Erasure Channels
نویسندگان
چکیده
منابع مشابه
Study of the Decoding Complexity for Rateless Erasure Codes
Over the Internet, bit errors within the data packets translate into packet losses at the higher layers of the OSI model, yielding a packet erasure channel. Modern erasure correcting codes promise to offer a very simple and efficient solution to data transfers over these channels, opening up also other interesting applications. Amongst them one can enumerate reliable large scale content distrib...
متن کاملJoint Cache-Channel Coding over Erasure Broadcast Channels
We consider a cache-aided communications system in which a transmitter communicates with many receivers over an erasure broadcast channel. The system serves as a basic model for communicating on-demand content during periods of high network congestion, where some content can be preplaced in local caches near the receivers. We formulate the cacheaided communications problem as a joint cache-chan...
متن کاملCan Basic ML Techniques Illuminate Rateless Erasure Codes?
The recently developed rateless erasure codes are a near-optimal channel coding technique that guarantees low overhead and fast decoding. The underlying theory, and current implementations, of these codes assume that a network transmitter encodes according to a pre-specified probability distribution. In this report, we use basic Machine Learning techniques to try to understand what happens when...
متن کاملLayered multimedia broadcast using rateless codes with progressive recovery over cooperative MIMO
This article proposes a novel scheme, based on unequal error protected rateless codes, for broadcasting layered multimedia over cooperative multiple-input multiple-output (MIMO). By taking advantage of both cooperation and broadcasting, we first present a two-phase cooperative MIMO broadcast scheme, which exploits distributed diversity in point-to-multipoint communication scenarios. Then, to en...
متن کاملRandom Linear Network Codes for Secrecy over Wireless Broadcast Channels
We consider a set of n messages and a group of k clients. Each client is privileged for receiving an arbitrary subset of the messages over a broadcast erasure channel, which generalizes scenario of a previous work. We propose a method for secretly delivering each message to its privileged recipients in a way that each receiver can decode its own messages but not the others’. Our method is based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2015
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2013.2295608